A Distributed Dual Proximal Minimization Algorithm for Constraint-Coupled Optimization Problems
نویسندگان
چکیده
We address constraint-coupled optimization for a system composed of multiple cooperative agents communicating over time-varying network. propose distributed proximal minimization algorithm that is guaranteed to converge an optimal solution the problem, under suitable convexity and connectivity assumptions. The performance introduced shown on numerical example charging scheduling problem fleet plug-in electric vehicles.
منابع مشابه
A Proximal Minimization Algorithm for Constrained Optimization
The proximal minimization algorithm (PMA) is an iterative method for minimizing a convex function f(x) over D, the closure of the essential domain of a second convex function h. The PMA is an interior-point algorithm, in the sense that each iterate lies within the interior of D. For each k, the next iterate, x, minimizes the function f(x) +Dh(x, x ), where Dh(x, z) = h(x)− h(z)− 〈∇h(z), x− z〉 i...
متن کاملConvergence of a Proximal Point Algorithm for Solving Minimization Problems
We introduce and consider a proximal point algorithm for solving minimization problems using the technique of Güler. This proximal point algorithm is obtained by substituting the usual quadratic proximal term by a class of convex nonquadratic distance-like functions. It can be seen as an extragradient iterative scheme. We prove the convergence rate of this new proximal point method under mild a...
متن کاملResilient Distributed Constraint Optimization Problems
Dynamic distributed constraint optimization problems (Dynamic DCOPs) are useful in modeling various distributed combinatorial optimization problems that are dynamically changing over time. Previous attempts assume that it is possible for agents to take on a new solution each time the problem changes. However, in some applications, it is necessary to commit to a single solution at the start of t...
متن کاملAsymmetric Distributed Constraint Optimization Problems
Distributed Constraint Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned by different agents. Many multi-agent problems include constraints that produce different gains (or costs) for the participating agents. Asymmetric gains of constrained agents cannot be naturally represented by the stand...
متن کاملDistributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems
This paper presents a new algorithm for solving distributed constraint satisfaction problems (distributed CSPs) called the distributed breakout algorithm, which is inspired by the breakout algorithm for solving centraiized CSPs. In this algorithm, each agent tries to optimize its evaluation value (the number of constraint violations) by exchanging its current value and the possible amount of it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Control Systems Letters
سال: 2021
ISSN: ['2475-1456']
DOI: https://doi.org/10.1109/lcsys.2020.3001427